Fair and Efficient Packet Scheduling Using Resilient Quantum Round-Robin

Round-robin based packet scheduling algorithms are suitable for high-speed networks, but in a variable-length packet environment, this kind of scheduling algorithm need consider packet length to guarantee scheduling fairness. Previous schemes are not perfect for fairness and efficiency. This paper presents a new easily implementable scheduling discipline, called Resilient Quantum Round-Robin (RQRR), in which the quantum given to each of the flows in a round is not fixed and is calculated depending on the transmission situation of all the flows in the previous round. We prove that the implementation complexity of RQRR is O (1) with respect to the number of flows. We analytically prove the fairness properties of RQRR, and show that its relative fairness measure has an upper bound of 7Max-1, where Max is the size of the largest packets. Finally, we present simulation results comparing the fairness and performance characteristics of RQRR with deficit round-robin (DRR), which show that RQRR achieves better short time scale fairness and scheduling delay properties.